Image encoding method, image decoding method, image encoding apparatus, image decoding apparatus, image encoding program, and image decoding program

ABSTRACT

The present invention is directed to a decoder for decoding encoded video data which comprises blocks of transform coefficients. The decoder comprises a reconstruction information receiver which acquires reconstruction information from an encoder regarding reconstruction of the blocks of transform coefficients. The decoder also comprises an entropy decoder which decodes the blocks of transform coefficients into decoded blocks of transform coefficients. The decoder further comprises a coefficient list maker. According to the acquired reconstruction information, the coefficient list maker combines the transform coefficients of the decoded blocks into a first list of transform coefficients in which the transform coefficients of a respective decoded block are interleaved with the transform coefficients of another decoded block.

This application is a continuation of application Ser. No. 10/680,205filed Oct. 8, 2003 now U.S. Pat. No. 7,916,959, which claims priorityunder 35 U.S.C. §119 to Japanese Patent Application No. 2002-295429filed Oct. 8, 2002. The entire contents of all of these applications areincorporated herein by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to an image encoding method, an imagedecoding method, an image encoding apparatus, an image decodingapparatus, an image processing system, an image encoding program, and animage decoding program capable of implementing efficient entropy codingof orthogonal transform coefficients in an orthogonal transformpermitting selection among multiple block sizes.

2. Related Background Art

Encoding techniques of image signals are used for transmission and foraccumulation and reproduction of image signals of still images, movingimages, and so on. Such techniques include known international standardencoding methods, e.g., ISO/IEC International Standard 10918(hereinafter referred to as JPEG) as an encoding technique for stillimages, and ISO/IEC international Standard 14496-2 (MPEG-4 Visual, whichwill be referred to hereinafter as MPEG-4) as an encoding technique formoving images. A newer known encoding method is ITU-T RecommendationH.264; ISO/IEC International Standard 14496-10 (Joint Final CommitteeDraft of Joint Video Specification,ftp//ftp.imtc-files.org/jvt-experts/2002 07 Klagenfurt/JVT-D157.zip,which will be referred to hereinafter as H.26L), which is a video codingmethod intended for joint international standardization by ITU-T andISO/IEC.

Image signals demonstrate close correlations between spatiallyneighboring pixels and thus transformation into the frequency domainleads to deviation of information to the low frequency region, whichenables reduction of redundancy by making use of the deviation.Therefore, the typical image encoding methods adopt a technique ofsubjecting image signals to an orthogonal transform to transform theminto orthogonal transform coefficients in the frequency domain, so as toachieve deviation of signal components to the low frequency region.Furthermore, the coefficient values are quantized so that small-valuedcoefficients are converted into zeros. A coefficient string is made byreading the coefficients in order from the lowest in the low frequencyregion and is subjected to entropy coding taking advantage of thedeviation of coefficient values, thus achieving efficient encoding withreduction of redundancy.

In this case, the Discrete Cosine Transform (DCT) is commonly used asthe orthogonal transform in terms of encoding efficiency and ease ofimplementation. The orthogonal transform such as the DCT is carried outin units of blocks resulting from division of image signals into blockseach consisting of a plurality of pixels. The size of the blocks, aswell as the property of the image signals, largely affects the encodingefficiency.

When image signals demonstrate only small change in the spatialproperty, image signals to be transformed into orthogonal transformcoefficients in a narrow frequency region are widely distributed on animage, and the redundancy can be reduced more with increase in the sizeof the blocks, i.e., the size of the orthogonal transform, so as toincrease the encoding efficiency, as compared with cases using smallerblocks, which raise the need for repeatedly expressing identicalorthogonal transform coefficients. When image signals demonstrate largechange in the spatial property on the other hand, the increase in thesize of blocks results in obtaining various frequency components oforthogonal transform coefficients thereof and thus decreasing thedeviation of coefficients, which makes efficient entropy codingdifficult and thus decreases the encoding efficiency.

In order to take advantage of the change of encoding efficiency due tothe changes in the sizes of the blocks for the orthogonal transform andthe property of image signals, the technology utilized is one ofpreparing orthogonal transform means in a plurality of block sizes inadvance and adaptively selecting and using a size achieving the bestencoding efficiency out of them. This technology is called AdaptiveBlock size Transforms (ABT) and is adopted in H.26L. FIGS. 1A-FIG. 1Eshow orthogonal transform blocks used for the ABT in H.26L. The ABTpermits a size achieving the best encoding efficiency to be selected outof four types of orthogonal transform block sizes shown in FIGS. 1B-1E,for each macroblock of 16×16 pixels shown in FIG. 1A. Pixel values ofeach macroblock are equally divided in units of blocks of the selectedsize and are then subjected to the orthogonal transform. By implementingsuch selection, it becomes feasible to achieve efficient reduction ofredundancy through the use of the orthogonal transform in accordancewith the change in the spatial property of image signals in themacroblocks. Reference should be made to H.26L as to more specificdetails of the ABT.

The entropy coding for the orthogonal transform coefficients obtained bythe orthogonal transform is effected on a coefficient string obtained bysequentially reading the orthogonal transform coefficients from thelowest in the low frequency region. FIG. 2A shows an order of readingcoefficients in an orthogonal transform block of 4×4 pixels. Since thecoefficients obtained by the orthogonal transform are arranged with thelowest frequency component (i.e., the dc component) at the left uppercorner, the coefficients are read out in order from the left uppercoefficient to obtain a coefficient string consisting of sixteencoefficients as shown in FIG. 2B. This reading order is called zig-zagscan.

The coefficients obtained by the orthogonal transform are noncorrelatedwith each other, and the signal components deviate to the low frequencyregion. For this reason, when they are further quantized, the lowerfrequency coefficients are more likely to be nonzero coefficient values,so that many zero-valued coefficients appear in the coefficient string.For example, it produces a sequence of coefficient values as shown inFIG. 2C. Therefore, for efficient entropy coding of the coefficientstring of this distribution, it is common practice in encoding of imagesto perform the encoding by expressing the coefficient string by thenumbers of continuous zero coefficients preceding a nonzero coefficient(runs) and coefficient values (levels) of the nonzero coefficients. Suchencoding with runs and levels is also used in the entropy coding oforthogonal transform coefficients by the ABT.

On the other hand, in order to increase the efficiency more in theentropy coding as described above, H.26L employs the technology calledContext-based Adaptive Variable Length Code (CAVLC), which is applied tothe orthogonal transform without the use of the ABT, i.e., to caseswhere the orthogonal transform is always carried out in units oforthogonal transform blocks of 4×4 pixels.

The CAVLC in H.26L utilizes the following features: the maximum numberof coefficients in the coefficient string obtained from each orthogonaltransform block of 4×4 pixels is 16, the magnitude of runs is restrictedby this maximum number, and the magnitude of levels tends to be largerat lower frequencies. A number of encoding tables used in variablelength encoding are prepared as optimized tables for respectiveconditions, and they are applied while sequentially being switched, soas to increase the encoding efficiency.

For example, in the case where runs are encoded in order, the first runcan take a variety of values from 0 to 14 (according to the definitionof runs in H.26L, the maximum value of runs is 14, which is two smallerthan the total number of coefficients). On the other hand, a runappearing in the last stage of the sequential encoding of runs can takeonly one of limited run values, because there is the upper limit to thenumber of coefficients in the coefficient string. Accordingly, as shownin FIG. 3, the right-side encoding table with the largest number ofelements in the encoding table is applied to runs appearing in theinitial stage, and the left-side encoding tables with the smaller numberof elements in each encoding table are applied to runs appearing in thelast stage. This permits assignment of codes of smaller bit counts andthus implements efficient entropy coding. The CAVLC achieves theefficient encoding by making use of the conditions such as the maximumnumber of coefficients in each block and placing restrictions on therange where values to be encoded can take. Reference should be made toH.26L as to more specific details of the CAVLC.

SUMMARY OF THE INVENTION

By applying the foregoing CAVLC to the ABT, it can be expected that moreefficient entropy coding will also be achieved with the coefficientstrings of the ABT.

However, the CAVLC achieves the increase of encoding efficiency byoptimizing the encoding tables in variable length coding for therespective conditions, based on the maximum number of coefficients inblocks, and applying the encoding tables to the encoding with switchingamong them.

In use of the ABT, the number of coefficients in each block differsdepending upon blocks of different sizes; 64 in the case of 8×8 blocksin FIG. 1B, 32 in the cases of 8×4 and 4×8 blocks in FIGS. 1C and 1D,and 16 in the case of 4×4 blocks in FIG. 1E. For this reason, theapplication of the CAVLC requires consideration to the huge number ofconditions that can occur in the respective cases.

For example, supposing the encoding tables are set according to themaximum number of coefficients in coefficient strings, like the encodingtables of runs shown in FIG. 3, the huge number of encoding tables mustbe prepared; in the case of 8×8 blocks with the number of coefficientsbeing 64, it is necessary to prepare the encoding tables ranging fromthe encoding table of the number of elements being 2 to the encodingtable of the number of elements being 62. Likewise, in the cases of 8×4and 4×8 blocks with the number of coefficients being 32, the encodingtables must be prepared from that of the number of elements being 2 tothat of the number of elements being 30.

When the entropy coding adapted to the characteristics of coefficientslike the CAVLC was attempted to be applied to the orthogonal transformsselectively using the orthogonal transform blocks of different sizeslike the ABT as described above, there was the problem that the numberof encoding tables to be prepared became huge and the memory capacitynecessary for retention of the encoding tables became so large. Since italso involved the use of the different encoding tables for blocks ofrespective sizes and the different selection procedures thereof, therewas the problem that the procedure in the entropy coding becamecomplicated and thus implementing means and instrumental structurebecame complicated.

The present invention has been accomplished in order to solve the aboveproblems, and an object of the invention is to provide an image encodingmethod, an image decoding method, an image encoding apparatus, an imagedecoding apparatus, an image processing system, an image encodingprogram, and an image decoding program enabling efficient entropy codingin the orthogonal transform of variable sizes.

In order to achieve the above object, an image encoding method(apparatus) according to the present invention is an image encodingmethod (apparatus) of dividing image signals into blocks, performing anorthogonal transform of each block, reading resultant orthogonaltransform coefficients to obtain a coefficient string, and performingentropy coding thereof, the image encoding method (apparatus)comprising: a block selecting step (means) of selecting a size of ablock for the orthogonal transform, out of a plurality of blocks ofdifferent sizes; a coefficient string dividing step (means) of, when ablock of a size larger than a minimum size is selected in the blockselecting step (means), dividing a coefficient string in the block intoa plurality of coefficient strings of a length equal to that of acoefficient string in a block of the minimum size; and an encoding step(means) of performing entropy coding adapted to the coefficient stringin the block of the minimum size. An image encoding program according tothe present invention is configured to let a computer execute each ofthe above steps.

In the image encoding method according to the present invention, asdescribed above, when a block of a large size is selected to besubjected to the orthogonal transform, the coefficient string in thatblock is first divided into coefficient strings and then the entropycoding is carried out for each of them. This permits the entropy codingadapted to the coefficient string in the block of the minimum size to beapplied to the entropy coding of the coefficient string in the selectedblock, whereby it is feasible to implement efficient entropy coding oforthogonal transform coefficients, without complicating the procedure ofentropy coding.

In the above image encoding method (apparatus), the coefficient stringdividing step (means) may be configured to read coefficients of thecoefficient string from the lowest in a low frequency region and assignthe read coefficients one by one in order to the plurality ofcoefficient strings of the length equal to that of the coefficientstring in the block of the minimum size, thereby obtaining the dividedcoefficient strings. In the above image encoding program, thecoefficient string dividing step executed by the computer may also beconfigured to read coefficients of the coefficient string from thelowest in a low frequency region and assign the read coefficients one byone in order to the plurality of coefficient strings of the length equalto that of the coefficient string in the block of the minimum size,thereby obtaining the divided coefficient strings.

In the above image encoding method (apparatus), the coefficient stringdividing step (means) may be configured to read coefficients of thecoefficient string from the lowest in a low frequency region andrepeatedly perform reading of coefficients by the number equal to thenumber of coefficients in the coefficient string in the block of theminimum size to obtain a divided coefficient string, thereby obtainingthe divided coefficient strings. In the above image encoding program,the coefficient string dividing step executed by the computer may alsobe configured to read coefficients of the coefficient string from thelowest in a low frequency region and repeatedly perform reading ofcoefficients by the number equal to the number of coefficients in thecoefficient string in the block of the minimum size to obtain a dividedcoefficient string, thereby obtaining the divided coefficient strings.

An image decoding method (apparatus) according to the present inventionis an image decoding method (apparatus) of decoding encoded data encodedby an image encoding method of dividing image signals into blocks,performing an orthogonal transform of each block, reading resultantorthogonal transform coefficients to obtain a coefficient string, andperforming entropy coding thereof, the image decoding method (apparatus)comprising: a block selecting step (means) of selecting a size of ablock for the orthogonal transform, out of a plurality of blocks ofdifferent sizes; a decoding step (means) for performing decoding of theencoded data by entropy coding adapted to a coefficient string in ablock of a minimum size out of the plurality of blocks; and acoefficient string constructing step (means) of, when a block of a sizelarger than the minimum size is selected in the block selecting step(means), constructing a coefficient string of the block of the largersize from a plurality of coefficient strings decoded in the decodingstep (means). An image decoding program according to the presentinvention is configured to let a computer execute each of the abovesteps.

In the image decoding method according to the present invention, asdescribed above, when a block of a larger size is selected to implementdecoding of the encoded data subjected to the orthogonal transform, thecoefficient string in that block is constructed from coefficient stringsof blocks included in that block. This permits a coefficient string tobe decoded from the encoded data by the entropy coding adapted to thecoefficient string in the block of the minimum size, whereby it isfeasible to implement efficient entropy coding of orthogonal transformcoefficients, without complicating the procedure of decoding of entropycoding.

In the above image decoding method (apparatus), the coefficient stringconstructing step (means) may be configured to read coefficients in theplurality of coefficient strings decoded in the decoding step (means),from the lowest in a low frequency region and write the coefficientsread out of the respective coefficient strings, one by one in order intoa new coefficient string from the low frequency region, therebyobtaining the constructed coefficient string. In the above decodingprogram, the coefficient string constructing step executed by thecomputer may also be configured to read coefficients in the plurality ofcoefficient strings decoded in the decoding step, from the lowest in alow frequency region and write the coefficients read out of therespective coefficient strings, one by one in order into a newcoefficient string from the low frequency region, thereby obtaining theconstructed coefficient string.

In the above image decoding method (apparatus), the coefficient stringconstructing step (means) may be configured to read coefficients in theplurality of coefficient strings decoded in the decoding step (means),from the lowest in a low frequency region and write the readcoefficients in units of the original coefficient strings into a newcoefficient string from the low frequency region, thereby obtaining theconstructed coefficient string. In the above image decoding program, thecoefficient string constructing step executed by the computer may alsobe configured to read coefficients in the plurality of coefficientstrings decoded in the decoding step, from the lowest in a low frequencyregion and write the read coefficients in units of the originalcoefficient strings into a new coefficient string from the low frequencyregion, thereby obtaining the constructed coefficient string.

An image processing system according to the present invention comprisesthe above image encoding apparatus and the above image decodingapparatus.

The image processing system enables efficient entropy coding in theorthogonal transform of variable sizes because of the provision of theabove image encoding apparatus and also enables decoding of codesentropy-encoded by the above image encoding apparatus, because of theprovision of the above image decoding apparatus.

The present invention will be more fully understood from the detaileddescription given hereinbelow and the accompanying drawings, which aregiven by way of illustration only and are not to be considered aslimiting the present invention.

Further scope of applicability of the present invention will becomeapparent from the detailed description given hereinafter. However, itshould be understood that the detailed description and specificexamples, while indicating preferred embodiments of the invention, aregiven by way of illustration only, since various changes andmodifications within the spirit and scope of the invention will beapparent to those skilled in the art from this detailed description.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A to FIG. 1E are diagrams showing the orthogonal transform blocksused in the Adaptive Block size Transforms (ABT) of H.26L.

FIG. 2A to FIG. 2C are diagrams showing a readout method of readingcoefficients in a 4×4 block, and an example of a coefficient stringafter readout.

FIG. 3 is a diagram showing the encoding tables of runs used in theContext-based Adaptive Variable Length Code (CAVLC) of H.26L.

FIG. 4A to FIG. 4D are diagrams showing an example in which a method ofreadout and division of orthogonal transform coefficients according tothe present invention is carried out for an 8×8 block.

FIG. 5A to FIG. 5C are diagrams showing definitions of arrangement inoriginal blocks, of coefficient strings after division according to thepresent invention.

FIGS. 6A to FIG. 6D are diagrams showing an example in which anothermethod of readout and division of orthogonal transform coefficientsaccording to the present invention is carried out for an 8×8 block.

FIG. 7 is a block diagram showing a configuration of an image processingsystem according to an embodiment.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

The preferred embodiments of the image encoding method, image decodingmethod, image encoding apparatus, image decoding apparatus, and imageprocessing system according to the present invention will be describedbelow in detail with reference to the drawings. The same elements willbe denoted by the same reference symbols throughout the description ofthe drawings, without redundant description thereof.

The description will be based on the premise that the encoding anddecoding in the description hereinafter are implemented on the basis ofH.26L, and the part without specific description about the operation inthe image encoding is supposed to conform to the operation in H.26L. Itis, however, noted that the present invention is not limited to H.26L.

An embodiment of the present invention will be described. In theencoding according to the present embodiment, concerning the orthogonaltransform coefficients in blocks of the respective sizes in the ABT ofH.26L, a coefficient string obtained from each block is divided into aplurality of coefficient strings each consisting of coefficients in thenumber equal to the number of coefficients in a coefficient string of a4×4 block. This makes it feasible to perform the entropy coding by theCAVLC of H.26L defined so as to be adapted to the 4×4 blocks.

It is assumed that in the encoding, first, the ABT in H.26L is appliedto one macroblock, a size achieving the best encoding efficiency isselected out of the blocks shown in FIGS. 1B-1E, and the orthogonaltransform is effected in units of the blocks of the selected size.

It is also assumed that the CAVLC in H.26L is employed as the entropycoding of orthogonal transform coefficients. Namely, it is assumed thatonly the variable length encoding adapted to the encoding of orthogonaltransform coefficients for the 4×4 block shown in FIG. 1E is defined.

For example, let us suppose herein that the 8×8 block in FIG. 1B isselected. The following readout operation of reading the orthogonaltransform coefficients is carried out for this 8×8 block. First, sixtyfour coefficients in the 8×8 block are read out by zig-zag scan as shownin FIG. 4A, to obtain a coefficient string as shown in FIG. 4B.

Then this coefficient string is divided into four coefficient stringseach consisting of sixteen coefficients, the number of which is the sameas the number of coefficients in the coefficient string of the 4×4block. Here the coefficients in the original coefficient string are readout from the lowest in the low frequency region and alternately assignedto the four coefficient strings, thereby obtaining the coefficientstrings after division. FIG. 4C and FIG. 4D show this readout operation.Since the coefficients are alternately assigned to the respectivecoefficient strings from the lowest in the low frequency region, thefirst divided coefficient string is assigned the coefficients read outin the order of the zeroth, fourth, eighth, twelfth, . . . in theoriginal coefficient string, and the second divided coefficient stringis assigned the coefficients read out in the order of the first, fifth,ninth, thirteenth, . . . in the original coefficient string. The thirdand fourth divided coefficient strings are not illustrated in FIGS.4A-4D.

Similarly, when the 8×4 block or 4×8 block of FIG. 1C or FIG. 1D isselected, thirty two coefficients are divided into two coefficientstrings each consisting of sixteen coefficients. The readout method forobtaining the divided coefficient strings is also similar to that in thecase of the 8×8 block except that the number of coefficient stringsalternately assigned the coefficients is 2, instead of 4; thecoefficients in the original coefficient string are read out from thelowest in the low frequency region and alternately assigned to the twocoefficient strings.

The coefficient strings obtained in this way are entropy encodedaccording to the same procedure as the encoding of CAVLC without the useof the ABT, and the encoded data is outputted in order as encoded dataof orthogonal transform coefficients in the ABT block.

At this time, the CAVLC of H.26L utilizes the space context to switchthe applied encoding table on the basis of the number of nonzerocoefficients in an adjacent 4×4 block. For this reason, arrangements ofcoefficient strings after division in the ABT blocks are defined for theABT blocks larger than the 4×4 block. The definitions are presented inFIG. 5A to FIG. 5 c. For example, the 8×8 block shown in FIG. 5A ishandled on the assumption that the first divided coefficient stringillustrated in FIG. 4C is located at the position of “1” and the seconddivided coefficient string illustrated in FIG. 4D at the position of“2.” It is assumed that, using the definitions of the arrangement, thespace context for the divided coefficient strings in the ABT blocks, orthe space context for 4×4 blocks adjacent to the ABT blocks is handledin the same manner without any change as in the technique in the CAVLCof H.26L.

In the decoding, the original orthogonal transform matrix can beobtained according to the procedure reverse to the procedure in theencoding.

Let us suppose that the ABT in H.26L is applied to one macroblock, asize is designated out of the blocks shown in FIGS. 1B to 1E, andencoded data from this macroblock is one resulting from the orthogonaltransform carried out in units of ABT blocks of the size.

At this time the encoded data contains encoded data obtained by entropycoding of the divided coefficient strings by the CAVLC, in order asencoded data of orthogonal transform coefficients in the ABT blocks.Accordingly, it is sequentially decoded according to the procedure ofCAVLC to obtain the coefficient strings after the division.

Since these divided coefficient strings are coefficient strings dividedby the readout method shown in FIGS. 4A-4D, the original orthogonaltransform coefficient block can be obtained by conversely writing thecoefficients of the divided coefficient strings into each originalcoefficient string and further writing the resultant coefficient stringsinto the orthogonal transform coefficient block. The procedurethereafter is the same as the decoding procedure with application of theABT in H.26L.

A configuration of image processing system 1 for implementing the aboveimage encoding and image decoding will be described below. FIG. 7 is ablock diagram showing image processing system 1 according to anembodiment. The image processing system 1 is composed of image encodingapparatus 10 for encoding image data, and image decoding apparatus 20.

The image encoding apparatus 10 has orthogonal transform unit 11,coefficient string divider 12, entropy encoder 13, and block selector14. The orthogonal transform unit 11 has a function of performing theorthogonal transform of image data to transform it into frequencycomponents. The orthogonal transform unit 11 divides each macroblock ofthe image data into a plurality of blocks and performs the orthogonaltransform of the divided blocks. It is connected to block selector 14,and the block selector 14 selects a block capable of implementing theorthogonal transform with the best efficiency.

The coefficient string divider 12 has a function of dividing acoefficient string obtained by the orthogonal transform, intocoefficient strings of a predetermined length. Here the term“predetermined length” is defined as a length of a coefficient stringobtained by the orthogonal transform of a block of a minimum size out ofthe blocks into which a macroblock can be divided for the orthogonaltransform of image data by orthogonal transform unit 11.

The entropy encoder 13 has a function of encoding the coefficientstrings divided by the coefficient string divider 12. Since thecoefficient string divider 12 divides the original coefficient stringinto the coefficient strings of the same length as that of thecoefficient string of the minimum block as described above, the entropyencoder 13 can be configured to be adapted for encoding of thecoefficient strings of that length and can perform efficient encoding.

The image decoding apparatus 20 has entropy decoder 23, coefficientstring constructor 22, inverse orthogonal transform unit 21, and blockselector 24. The entropy decoder 23 has a function of decoding encodeddata.

The coefficient string constructor 22 has a function of constructing anoriginal coefficient string from coefficient strings divided uponencoding by image encoding apparatus 10. The coefficient stringconstructor 22 is connected to block selector 24, acquires informationabout the size of the original block from the block selector 24, andconstructs the original coefficient string on the basis of theinformation. The block selector 24 is able to acquire the size of theoriginal block, based on additional information or the like transmittedwith the encoded data from the image encoding apparatus.

The inverse orthogonal transform unit 21 has a function of transformingthe coefficient strings constructed by the coefficient stringconstructor 22, into image data.

The image processing system 1 of the structure as described aboveimplements the aforementioned image encoding and image decoding. Theaforementioned image encoding method and image decoding method can besubstantialized by an image encoding program and an image decodingprogram for letting a computer execute each of the steps thereof.

In the present embodiment the zig-zag scan was applied to readout oforthogonal transform coefficients, but the readout method ofcoefficients in application of the present invention does not have to belimited to the zig-zag scan. For example, the present invention may alsobe applied to cases of application of the field scan for field encodingin interlaced images, which is defined in the ABT of H.26L. In thisapplication, the dividing technique of the coefficient strings in thepresent embodiment can also be applied as it is.

The present embodiment showed the alternate readout method as shown inFIGS. 4A-4D, as a readout method for obtaining the coefficient stringsafter the division, but it is also possible to obtain the coefficientstrings after the division by another readout method differenttherefrom. For example, as shown in FIGS. 6C and 6D, sixteen consecutivecoefficients each are read out from the original coefficient string fromthe lowest in the low frequency region and each series is assigned toone of the coefficient strings after the division.

In the present embodiment, the readout of orthogonal transformcoefficients in the encoding is implemented so as to first perform thefirst readout for obtaining the coefficient string from the orthogonaltransform block and then perform the second readout for obtaining aplurality of Coefficient strings after the division. The writing oforthogonal transform coefficients in the decoding is implemented so asto first perform the first writing for obtaining the coefficient stringafter construction and then perform the second writing for obtaining theorthogonal transform block. However, the readout and writing ofcoefficients according to the present invention do not have to belimited to these methods, but may also be implemented by a variety ofreadout and writing methods that can obtain coefficient strings in thedesired arrangement. For example, it is also possible to implement suchreadout as to immediately obtain a plurality of divided coefficientstrings in the first coefficient readout from the orthogonal transformblock. The writing from the divided coefficient strings may also bemodified so as to immediately obtain the orthogonal transform block inthe first coefficient writing.

In the present embodiment, the coefficient strings after the divisionwere arranged as shown in FIGS. 5A-5C, and the space context from theadjacent 4×4 block in the CAVLC in H.26L was assumed to be handledwithout any change. In this regard, it can also be contemplated that thecoefficient strings divided from the coefficient strings of the ABTblocks larger than the 4×4 block are originally different in theproperty from the coefficient strings in the case of the 4×4 block andweights are given to numerals used as the space context. Specifically,where the number of nonzero coefficients is used as the space contextfrom the adjacent block, a constant is always added to or multiplied bythe number of nonzero coefficients in each divided coefficient stringobtained from an ABT block larger than the 4×4 block, when used as thespace context. In another configuration, where the coefficient stringsafter the division are obtained by continuously reading out thecoefficients from the lowest in the low frequency region as shown inFIGS. 6A-6D, different constants may be added to or multiplied bycoefficients read out from the low frequency region and coefficientsread out from the high frequency region.

The embodiments were described on the premise that the encoding anddecoding were substantialized on the basis of H.26L and were describedbased on the ABT and CAVLC in H.26L. However, it is noted that the imageencoding methods to which the present invention can be applied are notlimited to H.26L, and the present invention can be applied to variousimage encoding methods permitting selection among a plurality of sizesof blocks for the orthogonal transform and using the entropy codingadapted to the orthogonal transform coefficients.

The image encoding method, image decoding method, image encodingapparatus, image decoding apparatus, and image processing systemaccording to the present invention provide the following effect, asdetailed above. Namely, where a size of a block for the orthogonaltransform can be selected from a plurality of sizes, a coefficientstring consisting of resultant orthogonal transform coefficients isdivided into a plurality of coefficient strings of the same size as thatof the coefficient string in the block of the minimum size and each ofthese coefficient strings is subjected to the entropy coding adapted tothe coefficient string in the block of the minimum size; whereby it isfeasible to implement the efficient entropy coding, without increase inthe number of encoding tables in the entropy coding and withoutcomplicating the encoding tables and the procedure of selection thereof.

From the invention thus described, it will be obvious that the inventionmay be varied in many ways. Such variations are not to be regarded as adeparture from the spirit and scope of the invention, and all suchmodifications as would be obvious to one skilled in the art are intendedfor inclusion within the scope of the following claims.

1. A decoder for decoding encoded video data which comprises blocks oftransform coefficients, comprising: a reconstruction informationreceiver configured to acquire reconstruction information from anencoder regarding reconstruction of the blocks of transformcoefficients; an entropy decoder configured to decode the blocks oftransform coefficients into decoded blocks of transform coefficients;and a coefficient list maker configured to combine, according to theacquired reconstruction information, the transform coefficients of thedecoded blocks into a first list of transform coefficients in which thetransform coefficients of a respective decoded block are interleavedwith the transform coefficients of another decoded block.
 2. The decoderaccording to claim 1, wherein the decoded block comprises 4×4 transformcoefficients.
 3. The decoder according to claim 1, wherein the firstlist comprises 8×8 transform coefficients.
 4. The decoder according toclaim 1, further comprising a transformer configured to perform aninverse discrete cosine transform on the transform coefficients in thefirst list.
 5. The decoder according to claim 1, wherein according tothe acquired reconstruction information, the coefficient list makerconstructs a second list of transform coefficients from a single decodedblock of transform coefficients.
 6. The decoder according to claim 1,further comprising a second list maker configured to make a third listof transform coefficients from at least one first list of transformcoefficients.
 7. The decoder according to claim 6, wherein the secondlist comprises 16×16 transform coefficients.
 8. A method for decodingencoded video data which comprises blocks of transform coefficients,comprising: acquiring reconstruction information from an encoderregarding reconstruction of the blocks of transform coefficients;entropy-decoding the blocks of transform coefficients into decodedblocks of transform coefficients; and according to the acquiredreconstruction information, combining the transform coefficients of thedecoded blocks into a first list of transform coefficients in which thetransform coefficients of a respective decoded block are interleavedwith the transform coefficients of another decoded block.
 9. The methodaccording to claim 8, wherein the decoded block comprises 4×4 transformcoefficients.
 10. The method according to claim 8, wherein the firstlist comprises 8×8 transform coefficients.
 11. The method according toclaim 8, further comprising performing an inverse discrete cosinetransform on the transform coefficients in the first list.
 12. Themethod according to claim 8, further comprising constructing, accordingto the acquired reconstruction information, a second list of transformcoefficients from a single decoded block of transform coefficients. 13.The method according to claim 8, further comprising making a third listof transform coefficients from at least one first list of transformcoefficients.
 14. The method according to claim 13, wherein the secondlist comprises 16×16 transform coefficients.